-
Notifications
You must be signed in to change notification settings - Fork 1
Add sweep clustering #66
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
81b41b4 to
fd9c1e2
Compare
fd9c1e2 to
e303b8d
Compare
Code ReviewSummaryThe sweep clustering algorithm is a solid start — the polar-angle sort with distance as a tiebreaker is the right approach for the sweep heuristic. A few issues should be addressed before merging. Critical Issues1. Protocol signature mismatch
Either update the protocol to include these parameters (which makes sense since geographic clustering algorithms generally need an anchor point) or use a different approach (e.g., inject coordinates at construction time). 2.
|
ludavidca
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Overall Implementation seems solid, but there are still some lint issues! Please feel free to resolve them and request review again!
JIRA ticket link
F4KRP-130
Implementation description
Steps to test
There's a test file (sweep_algorithm_test.py) - there are variables on Lines 33 - 35 that can be adjusted - feel free to test it out with that for different cluster numbers, locations per cluster, and max boxes per cluster.
The test can be run with
docker compose exec backend sh -lc 'python -m app.services.implementations.sweep_algorithm_test'What should reviewers focus on?
Correctness of sweep ordering implementation
Checklist